Matched subspace detectors
نویسندگان
چکیده
In this paper we formulate a general class of problems for detecting subspace signals in subspace interference and broadband noise. We derive the generalized likelihood ratio (GLR) for each problem in the class. We then establish the invariances for the GLR and argue that these are the natural invariances for the problem. In each case, the GLR is a maximal invariant statistic, and the distribution of the maximal invariant statistic is monotone. This means that the GLR test (GLRT) is the uniformly most powerful invariant detector. We illustrate the utility of this finding by solving a number of problems for detecting subspace signals in subspace interference and broadband noise. In each case we give the distribution for the detector and compute performance curves.
منابع مشابه
Time-Frequency Subspace Detectors and Application to Knock Detection
Abstract We consider a composite hypotheses detection problem involving a subspace and an energy level, and we show that for this problem the matched subspace detector is uniformly most powerful and the generalized likelihood ratio detector. We present a generalization of the matched subspace detector and time-frequency methods for the formulation and design of subspace detectors. Finally, we a...
متن کاملMatched Subspace Detectors for Distinguishingbetween Two Signals with Extensions to BlindMaximum Likelihood Sequence
| The problem of distinguishing between two signals when only a ltered version of the transmitted signals is available and the coeecients of the lter are unknown gives rise to matched subspace detector. In this paper we will investigate the performance of matched subspace detectors for distinguishing between two signals. We will demonstrate that the matched subspace detector is equivalent to a ...
متن کاملA Comparative Analysis of Kernel Subspace Target Detectors for Hyperspectral Imagery
Several linear and nonlinear detection algorithms that are based on spectral matched (subspace) filters are compared. Nonlinear (kernel) versions of these spectral matched detectors are also given and their performance is compared with linear versions. Several well-known matched detectors such as matched subspace detector, orthogonal subspace detector, spectral matched filter, and adaptive subs...
متن کاملMatched Subspace Detectors for Stochastic Signals
Our aim in this paper is to extend the matched subspace detectors (MSDs) of [1–3] to the detection of stochastic signals. In [1–3] the signal to be detected was assumed to be placed deterministically at an unknown location in a known signal subspace. The basis for the subspace was irrelevant. In this paper the signal is assumed to be placed randomly at an unknown location in a known subspace. I...
متن کاملRobust Gaussian and non-Gaussian matched subspace detection
We address the problem of matched filter and subspace detection in the presence of arbitrary noise and interference or interfering signals that may lie in an arbitrary unknown subspace of the measurement space. A minmax methodology developed to deal with this uncertainty can also be adapted to situations where partial information on the interference or other uncertainties is available. This met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 42 شماره
صفحات -
تاریخ انتشار 1994